Eventually-serializable data services

Optimal Deployment of Eventually-Serializable Data Services

Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce significant communication costs to maintain consistency between the replicas. Eventually-Serializable Data Service (ESDS) has been proposed to reduce these costs and enable fast operations on data, while still providing guarantees th...

Implementation and Evaluation of an Eventually - Serializable Data Service

This thesis builds on the work of Fekete et al. [1], who defined an eventually-serializable data service (ESDS) and an abstract algorithm for it. ESDS allows its users to relax consistency requirements in return for improved responsiveness, while providing guarantees of eventual consistency of the replicated data. An important consideration in formulating ESDS was that it could be employed in b...

Preserving Data Integrity in HDDBSs Using Quasi Serializable Executions

Universally Serializable Computation

Cai and Furst CF91] proved that every PSPACE language can be solved via a large number of identical, simple tasks, each of which is provided with the original input, its own unique task number, and at most three bits of output from the previous task. In the Cai-Furst model, the tasks are required to be run in the order speciied by the task numbers. To study the extent to which the Cai-Furst PSP...

On Serializable Languages

Cai and Furst introduced the notion of bottleneck Turing machines and showed that the languages recognized by width-5 bottleneck Turing machines are exactly those in PSPACE. Computational power of bottleneck Turing machines with width fewer than 5 is investigated. It is shown that width-2 bottleneck Turing machines capture polynomial-time many-one closure of nearly near-testable sets. For langu...